On the Parameterized Complexity of Default Logic and Autoepistemic Logic
نویسندگان
چکیده
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, the extension existence problem for default logic, as well as the expansion existence problem for autoepistemic logic and obtain fixed-parameter time and space efficient algorithms for these problems. On the other hand, we exhibit, for each of the above problems, families of instances of a very simple structure that, for a wide range of different parameterizations, do not have efficient fixed-parameter algorithms (even in the sense of the large class XPnu), unless P = NP.
منابع مشابه
A Survey on Complexity Results for Non-monotonic Logics
This paper surveys the main results appeared in the literature on the computational complexity of non-monotonic inference tasks. We not only give results about the tractability/intractability of the individual problems but we also analyze sources of complexity and explain intuitively the nature of easy/hard cases. We focus mainly on non-monotonic formalisms, like default logic, autoepistemic lo...
متن کاملOn the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription
This paper concentrates on comparing the relative expressive power of ve non-monotonic logics that have appeared in the literature. The results on the computational complexity of these logics suggest that these logics have very similar expressive power that exceeds that of classical monotonic logic. A reened classiication of non-monotonic logics by their expressive power can be obtained using t...
متن کاملMore on modal aspects of default logic
Investigations of default logic have been so far mostly concerned with the notion of an extension of a default theory. It turns out, however, that default logic is much richer. Namely, there are other natural classes of objects that might be associated with default reasoning. We study two such classes of objects with emphasis on their relations with modal nonmonotonic formalisms. First, we intr...
متن کاملDigital Systems Laboratory Series A: Research Reports Priorities and Nonmonotonic Reasoning Priorities and Nonmonotonic Reasoning
Many knowledge-based systems use some kind of priorities for controlling their reasoning. In this work, autoepistemic logic is extended with priorities. Priorities are formalized as partial orders of formulae that express that some formulae are preferred to others. Priorities increase the set of conclusions that can be inferred from a set of formulae, because the number of cases where connicts ...
متن کاملModel Checking for Nonmonotonic Logics: Algorithms and Complexity
We study the complexity of model checking in propositional nonmonotonic logics. Specifically, we first define the problem of model checking in such formalisms, based on the fact that several nonmonotonic logics make use of interpretation structures (i.e. default extensions, stable expansions, universal Kripke models) which are more complex than standard interpretations of propositional logic. T...
متن کامل